Stable families of behavioural equivalences
نویسندگان
چکیده
منابع مشابه
On stable homotopy equivalences
A fundamental construction in the study of stable homotopy is the free infinite loop space generated by a space X. This is the colimit QX = lim −→ ΩΣX. The i homotopy group of QX is canonically isomorphic to the i stable homotopy group of X. Thus, one may obtain stable information about X by obtaining topological results about QX. One such result is the Kahn-Priddy theorem [7]. In another direc...
متن کاملOn the Complexity of Deciding Behavioural Equivalences
We give an overview of the computational complexity of all the equivalences in van Glabbeek's linear/branching time hierarchy and the preorders in the corresponding hierarchy of preorders. We consider nite state or regular processes as well as innnite-state BPA and BPP processes. A distinction, which turns out to be important in the nite-state processes, is that of simulation-like equivalences/...
متن کاملStructural and Behavioural Equivalences of Networks
We de ne an algebraic language for networks of synchronously communicating asynchronous processes. A node in the network may have several ports; a port is either external to the whole network or connected through a link to another port. The language contains two types of operations: parallel composition of two networks, and interlinking of two external ports within a network. We interpret this ...
متن کاملBehavioural Equivalences over Migrating Processes with Timers
The temporal evolution of mobile processes is governed by independently operating local clocks and their migration timeouts. We define a formalism modelling such distributed systems allowing (maximal) parallel execution at each location. Taking into account explicit timing constraints based on migration and interprocess communication, we introduce and study a number of timed behavioural equival...
متن کاملBehavioural equivalences for coalgebras with unobservable moves
We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on special order enriched categories, i.e. categories whose homsets are endowed with suitable complete orders. Using this structure we provide an abstract notion of saturation, which allows us to define various (weak) be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90065-0